Parametrized Infinite Games and Higher-Order Pushdown Strategies
نویسندگان
چکیده
We consider infinite two-player games parametrized by a set P of natural numbers where the winning condition is given by a regular ω-language (including the parameter P ). Extending recent work of Rabinovich we study here predicates P where the structure (N,+1, P ) belongs to the pushdown hierarchy (or “Caucal hierarchy”). For such a predicate P where (N,+1, P ) occurs in the k-th level of the hierarchy, we provide an effective determinacy result and show that winning strategies can be implemented by deterministic level-k pushdown automata.
منابع مشابه
Infinite regular games in the higher-order pushdown and the parametrized setting
Higher-order pushdown systems extend the idea of pushdown systems by using a “higher-order stack” (which is a nested stack). More precisely on level 1 this is a standard stack, on level 2 it is a stack of stacks, and so on. We study the higher-order pushdown systems in the context of infinite regular games. In the first part, we present a k-ExpTime algorithm to compute global positional winning...
متن کاملParametrized Regular Infinite Games and Higher-Order Pushdown Strategies
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular ω-language parametrized by P . In this context, an ω-word, representing a play, has letters consisting of three components: The first is a bit indicating membership of the current position in P , and the other two components are the letters contributed by the two players. Extending recent work ...
متن کاملInfinite Games over Higher-Order Pushdown Systems
In this thesis we deal with games over infinite graphs with regular winning conditions. A well studied family of such games are the pushdown games. An important result for these games is that the winning region can be described by regular sets of configurations. We extend this result to games defined by higher-order pushdown systems. The higher-order pushdown systems extend the usual pushdown s...
متن کاملPositional Strategies for Higher-Order Pushdown Parity Games
Higher-order pushdown systems generalize pushdown systems by using higher-order stacks, which are nested stacks of stacks. In this article, we consider parity games defined by higher-order pushdown systems and provide a k-Exptime algorithm to compute finite representations of positional winning strategies for both players for games defined by level-k higher-order pushdown automata. Our result i...
متن کاملInfinite-state games with finitary conditions
We study two-player zero-sum games over infinite-state graphs with boundedness conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi games, and finite-memory suffices for finitary parity games. We then study pushdown boundedness...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009